IP Lookup using Two-level Indexing and B-Trees

Networks are expanding very fast and the number of clients is increasing dramatically, this causes the router forwarding table to become very large and present more demand on faster router operations. In this paper, we address the problem of packet forwarding in the routers aiming to increase the speed of address lookup and minimize the memory required for storing the forwarding table. We propose a new algorithm that makes use of two-level indexing and Btrees. We test the approach and compare it to other famous IP lookup approaches. The preliminary simulations show 20% less memory requirements and the lookup speed scaling linearly with increasing table size.